Constructing error-correcting binary codes using transitive permutation groups
نویسندگان
چکیده
Let A2(n, d) be the maximum size of a binary code of length n and minimum distance d. In this paper we present the following new lower bounds: A2(18, 4) ≥ 5632, A2(21, 4) ≥ 40960, A2(22, 4) ≥ 81920, A2(23, 4) ≥ 163840, A2(24, 4) ≥ 327680, A2(24, 10) ≥ 136, and A2(25, 6) ≥ 17920. The new lower bounds are a result of a systematic computer search over transitive permutation groups.
منابع مشابه
On the nonexistence of completely transitive codes
Completely transitive codes were introduced by P. Solé as a special case of binary linear completely regular codes. The existence of such codes is closely related to the existence of certain permutation groups. The nonexistence of highly transitive permutation groups allows us to prove the nonexistence of completely transitive codes with error-correcting capability greater than 4.
متن کاملNonexistence of completely transitive codes with error-correcting capability e>3
The class of completely transitive codes was introduced by Solé as a proper subclass of binary linear completely regular codes. There exist completely transitive codes with error-correcting capabilities = 1 2 and 3. In a previous correspondence, Borges and Rifà proved the nonexistence of completely transitive codes with more than two codewords and error-correcting capability 4. In this correspo...
متن کاملPartial permutation decoding for binary Hadamard codes
Roland D. Barrolleta – Partial permutation decoding for binary Hadamard codes 1 Johann A. Briffa – Codes for Synchronization Error Correction 2 Wouter Castryck – Some two-torsion issues for curves in characteristic two 4 Gábor Fodor – Fingerprinting codes and their limits 5 E. Suárez-Canedo – About a class of Hadamard Propelinear Codes 6 Andrea Švob – On some transitive combinatorial structures...
متن کاملPermutation Groups, Error-Correcting Codes and Uncoverings
Permutation Groups, Error-Correcting Codes and Uncoverings Robert F. Bailey School of Mathematical Sciences Queen Mary, University of London Mile End Road, London E1 4NS United Kingdom [email protected] We replace the traditional setting of error-correcting codes (namely vector spaces over finite fields) with that of permutation groups, using permutations written in list form as the codewor...
متن کاملUncoverings-by-bases for base-transitive permutation groups
An uncovering-by-bases for a group G acting on a finite set Ω is a set U of bases forG such that any r-subset of Ω is disjoint from at least one base in U, where r is a parameter dependent on G. They have applications in the decoding of permutation groups when used as error-correcting codes, and are closely related to covering designs. We give constructions for uncoverings-by-bases for many fam...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 233 شماره
صفحات -
تاریخ انتشار 2017